Partition of an Integer into Distinct Bounded Parts, Identities and Bounds
نویسنده
چکیده
The partition function Q(n), which denotes the number of partitions of a positive integer n into distinct parts, has been the subject of a dozen papers. In this paper, we study this kind of partition with the additional constraint that the parts are bounded by a fixed integer. We denote the number of partitions of an integer n into distinct parts, each ≤ k, by Qk(n). We find a sharp upper bound for Qk(n), and more, an infinite series lower bound for the partition function Q(n). In the last section, we exhibit a group of interesting identities involving Qk(n) that arise from a combinatorial problem.
منابع مشابه
Partition Identities
A partition of a positive integer n (or a partition of weight n) is a non-decreasing sequence λ = (λ1, λ2, . . . , λk) of non-negative integers λi such that ∑k i=1 λi = n. The λi’s are the parts of the partition λ. Integer partitions are of particular interest in combinatorics, partly because many profound questions concerning integer partitions, solved and unsolved, are easily stated, but not ...
متن کاملThe Dual of Göllnitz’s (big) Partition Theorem*
A Rogers-Ramanujan (R-R) type identity is a q-hypergeometric identity in the form of an infinite (possibly multiple) series equals an infinite product. The series is the generating function of partitions whose parts satisfy certain difference conditions, whereas the product is the generating function of partitions whose parts usually satisfy certain congruence conditions. For a discussion of a ...
متن کاملShifted and Shiftless Partition Identities Ii
Let S and T be sets of positive integers and let a be a fixed positive integer. An a-shifted partition identity has the form p(S, n) = p(T, n − a), for all n ≥ a. Here p(S, n) is the number partitions of n whose parts are elements of S. For all known nontrivial shifted partition identities, the sets S and T are unions of arithmetic progressions modulo M for some M . In 1987, Andrews found two 1...
متن کاملNew Identities for the Polarized Partitions and Partitions with d-Distant Parts
In this paper we present a new class of integer partition identities. The number of partitions with d-distant parts can be written as a sum of the numbers of partitions of various lengths with 1-distant parts whose even parts, if there are any, are greater than twice the number of odd parts. We also provide a direct bijection between these classes of partitions. 1 Preliminaries and introduction...
متن کاملSome families of identities for the integer partition function
We give a series of recursive identities for the number of partitions with exactly k parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results, we demonstrate that the number of partitions of n is equal to the number of partitions of 2n + d ( n 2 ) of length n, with d-distant parts. We also provide a direct proof for this identity. This ...
متن کامل